. C O ] 9 M ay 2 00 9 On Longest Cycle C of a Graph G via Structures of G −
نویسندگان
چکیده
Two sharp lower bounds for the length of a longest cycle C of a graph G are presented in terms of the lengths of a longest path and a longest cycle of G − C, denoted by p and c, respectively, combined with minimum degree δ: (1) |C| ≥ (p + 2)(δ − p) and (2) |C| ≥ (c + 1)(δ − c + 1).
منابع مشابه
An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph
We improve Luczak’s upper bounds on the length of the longest cycle in the random graph G(n,M) in the “supercritical phase” where M = n/2 + s and s = o(n) but n2/3 = o(s). The new upper bound is (6.958 + o(1))s2/n with probability 1 − o(1) as n → ∞. Letting c = 1+2s/n, the equivalence between G(n, p) and G(n,M) implies the same result for G(n, p) where p = c/n, c → 1, c − 1 = ω(n−1/3).
متن کاملDeciding Graph non-Hamiltonicity via a Closure Algorithm
We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance (G) is initially coded as exclusion set ...
متن کاملCircumferences of 3-connected tough graphs with large degree sums
Let G be a 3-connected tough graph of order n with circumference c(G), independence number a(G) and vertex connectivity K(G) , such that d(x)+d(y)+ d(z)+d(w):2:s for any independent set { x, y, z, w} of vertices. In [7] we have proved: when s:2:n+c(G)/2, every longest cycle ofG is a dominating cycle and c(G) :2:min{n, n+s/4-a(G) }. This paper improves the results by showing that under the same ...
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کامل